Pseudo-Random Generators and Structure of Complete Degrees
نویسنده
چکیده
It is shown that if there exist sets in E that require -sized circuits then sets that are hard for class P, and above, under 1-1 reductions are also hard under 1-1, sizeincreasing reductions. Under the assumption of the hardness of solving RSA or Discrete Log problem, it is shown that sets that are hard for class NP, and above, under manyone reductions are also hard under (non-uniform) 1-1, and size-increasing reductions.
منابع مشابه
The Effect of Soil Type on Seismic Response of Tall Telecommunication Towers with Random Vibration Analysis
Random vibration analysis of tall structures faces multiple problems due to the large number of elements and high degrees of freedom; that is why this type of analysis is mostly used in simple structures and low degrees of freedom. In the past two decades, changes have been occurred in this type of analysis to be used in complex structures and the large number of elements. Pseudo-Excitation Met...
متن کاملRole of Symmetry and Geometry in a chaotic Pseudo-Random Bit Generator
In this work, Pseudo-Random Bit Generation (PRBG) based on 2D chaotic mappings of logistic type is considered. The sequences generated with two Pseudorandom Bit Generators (PRBGs) of this type are statistically tested and the computational effectiveness of the generators is estimated. The role played by the symmetry and the geometrical properties of the underlying chaotic attractors is also exp...
متن کاملUsing GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Recently, it was shown that using GLFSRs as pattern generators for pseudo-random logic tests can increase the fault coverage noticeably in comparison to standard pseudo-random test pattern generators. Since memory faults d...
متن کاملThe use of non-commutative algebra in cryptographically secure pseudo-random number generators
This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis ...
متن کاملEvaluation of splittable pseudo-random generators
Pseudo-random number generation is a fundamental problem in computer programming. In the case of sequential processing the problem is very well researched, but parallel processing raises new problems whereof far too little is currently understood. Splittable pseudo-random generators (S-PRNG) have been proposed to meet the challenges of parallelism. While applicable to any programming paradigm, ...
متن کامل